Topology of internally constrained polymer chains
نویسندگان
چکیده
منابع مشابه
Internally Constrained Mixtures of Elastic Continua
A treatment of internally constrained mixtures of elastic continua at a common temperature is de veloped. Internal constraints involving the defonnation gradient tensors and the common mixture temperature are represented by a constraint manifold, and an internally constrained mixture ofelastic continua is associated with each unique equivalence class ofunconstrained mixtures. The example of in...
متن کاملStiffness of polymer chains
A formula is derived for stiffness of a polymer chain in terms of the distribution function of end-to-end vectors. This relationship is applied to calculate the stiffness of Gaussian chains (neutral and carrying electric charges at the ends), chains modeled as self-avoiding random walks, as well as semi-flexible (worm-like and Dirac) chains. The effects of persistence length and Bjerrum’s lengt...
متن کاملAdsorption of polydisperse polymer chains
The adsorption of polydisperse ideal polymer chains is shown to be sensitive to the large N tail of the distribution of chains. If and only if the number of chains decays more slowly than exponentially then there is an adsorption transition like that of monodisperse infinite chains. If the number decays exponentially the adsorption density diverges continuously at a temperature which is a funct...
متن کاملFast simulation of polymer chains.
We propose an algorithm for the fast and efficient simulation of polymers represented by chains of hard spheres. The particles are linked by holonomic bond constraints. While the motion of the polymers is free (i.e., no collisions occur) the equations of motion can be easily integrated using a collocation-based partitioned Gauss-Runge-Kutta method. The method is reversible, symplectic, and pres...
متن کاملTopology Preserving Constrained Graph Layout
Constrained graph layout is a recent generalisation of forcedirected graph layout which allows constraints on node placement. We give a constrained graph layout algorithm that takes an initial feasible layout and improves it while preserving the topology of the initial layout. The algorithm supports poly-line connectors and clusters. During layout the connectors and cluster boundaries act like ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Chemistry Chemical Physics
سال: 2017
ISSN: 1463-9076,1463-9084
DOI: 10.1039/c7cp02145c